Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > Which of the is sufficient to represent any b... Start Learning for Free
Which of the is sufficient to represent any boolean operation.
- a){OR , OR}
- b){XOR}
- c){AND , AND}
- d)2×1 MUX
Correct answer is option 'D'. Can you explain this answer?
Most Upvoted Answer
Which of the is sufficient to represent any boolean operation.a){OR , ...
Concept:
- NOR,
- NAND,
- {OR and NOT i.e It behaves like NOR Gate } and
- {AND, NOT, It behaves like NAND Gate}
are the universal gates because they may be used to create any logic gate.
The given option 1, option 2 and option 3 are not sufficient to represent any boolean operation.
Option 1: {OR , OR} behaves like an OR gate. It can not sufficient for the universal gate.
Option 2: {XOR} is a simple XOR gate. It can not sufficient for the universal gate.
Option 3: {AND, AND} behaves like an AND gate. It can not sufficient for the universal gate.
Option 4: 2×1 MUX or 2X1 multiplexer is functionally complete provided we have external 1 and 0 available.
For NOT gate, use x as a select line and use 0 and 1 as inputs.
For AND gate, use y and 0 as inputs and x as select. With {AND, NOT} any other gate can be made.
Hence the correct answer is 2×1 MUX.
The given option 1, option 2 and option 3 are not sufficient to represent any boolean operation.
Option 1: {OR , OR} behaves like an OR gate. It can not sufficient for the universal gate.
Option 2: {XOR} is a simple XOR gate. It can not sufficient for the universal gate.
Option 3: {AND, AND} behaves like an AND gate. It can not sufficient for the universal gate.
Option 4: 2×1 MUX or 2X1 multiplexer is functionally complete provided we have external 1 and 0 available.
For NOT gate, use x as a select line and use 0 and 1 as inputs.
For AND gate, use y and 0 as inputs and x as select. With {AND, NOT} any other gate can be made.
Hence the correct answer is 2×1 MUX.
Free Test
FREE
| Start Free Test |
Community Answer
Which of the is sufficient to represent any boolean operation.a){OR , ...
C) {AND, AND}
 | Explore Courses for Computer Science Engineering (CSE) exam |  |
Top Courses for Computer Science Engineering (CSE)View all
Top Courses for Computer Science Engineering (CSE)
Question Description
Which of the is sufficient to represent any boolean operation.a){OR , OR}b){XOR}c){AND , AND}d)2×1 MUXCorrect answer is option 'D'. Can you explain this answer? for Computer Science Engineering (CSE) 2026 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Which of the is sufficient to represent any boolean operation.a){OR , OR}b){XOR}c){AND , AND}d)2×1 MUXCorrect answer is option 'D'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2026 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Which of the is sufficient to represent any boolean operation.a){OR , OR}b){XOR}c){AND , AND}d)2×1 MUXCorrect answer is option 'D'. Can you explain this answer?.
Which of the is sufficient to represent any boolean operation.a){OR , OR}b){XOR}c){AND , AND}d)2×1 MUXCorrect answer is option 'D'. Can you explain this answer? for Computer Science Engineering (CSE) 2026 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Which of the is sufficient to represent any boolean operation.a){OR , OR}b){XOR}c){AND , AND}d)2×1 MUXCorrect answer is option 'D'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2026 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Which of the is sufficient to represent any boolean operation.a){OR , OR}b){XOR}c){AND , AND}d)2×1 MUXCorrect answer is option 'D'. Can you explain this answer?.
Solutions for Which of the is sufficient to represent any boolean operation.a){OR , OR}b){XOR}c){AND , AND}d)2×1 MUXCorrect answer is option 'D'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE). Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.
Here you can find the meaning of Which of the is sufficient to represent any boolean operation.a){OR , OR}b){XOR}c){AND , AND}d)2×1 MUXCorrect answer is option 'D'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of Which of the is sufficient to represent any boolean operation.a){OR , OR}b){XOR}c){AND , AND}d)2×1 MUXCorrect answer is option 'D'. Can you explain this answer?, a detailed solution for Which of the is sufficient to represent any boolean operation.a){OR , OR}b){XOR}c){AND , AND}d)2×1 MUXCorrect answer is option 'D'. Can you explain this answer? has been provided alongside types of Which of the is sufficient to represent any boolean operation.a){OR , OR}b){XOR}c){AND , AND}d)2×1 MUXCorrect answer is option 'D'. Can you explain this answer? theory, EduRev gives you an ample number of questions to practice Which of the is sufficient to represent any boolean operation.a){OR , OR}b){XOR}c){AND , AND}d)2×1 MUXCorrect answer is option 'D'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
| Explore Courses for Computer Science Engineering (CSE) exam | |
Top Courses for Computer Science Engineering (CSE)
Explore Courses
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
